Abstraction Databases in Theory and Model Checking Practice
نویسندگان
چکیده
ion Databases in Theory and Model Checking Practice Stefan Edelkamp Fachbereich Informatik Universität Dortmund [email protected] Alberto Lluch-Lafuente Dipartimento di Informatica Università di Pisa [email protected]
منابع مشابه
کاهش شکاف آموزش- بالین با استفاده از مدل پرستار پژوهشگر بالینی
Background & Aim: Among the main reasons for the theory-practice gap is a lack of adequate clinical staff training in information seeking as well as in critical appraisal skills for research findings. In this regard, the clinical nurse scholar model has been introduced for training and supervising nurses in the application of the best available evidence to improve the quality of nursing care. T...
متن کاملAbstraction as the Key for Invariant Verification
ion as the Key for Invariant Veri cation Saddek Bensalem and Susanne Graf and Yassine Lakhnech VERIMAG Centre Equation avenue de Vignate F Gi eres France fbensalem graf lakhnechg imag fr Abstract We present a methodology for constructing abstractions and re ning them by analyzing counter examples We also present a uniform veri cation method that combines abstraction model checking and de ductiv...
متن کاملModel Checking Software Requirement Specifications using Domain Reduction Abstraction
As an automated verification and validation tool, model checking can be quite effective in practice, especially when it is used in the context of specification-centered or component-based software development frameworks. Nevertheless, model checking has been quite inefficient when dealing with systems with data variables over a large (or infinite) domain, which is a serious limiting factor for ...
متن کاملCounterexamples Revisited: Principles, Algorithms, Applications
Algorithmic counterexample generation is a central feature of model checking which sets the method apart from other approaches such as theorem proving. The practical value of counterexamples to the verification engineer is evident, and for many years, counterexample generation algorithms have been employed in model checking systems, even though they had not been subject to an adequate fundament...
متن کاملUsing Predicate Abstraction to Generate Heuristic Functions in UPPAAL
We focus on checking safety properties in networks of extended timed automata, with the well-known UPPAAL system. We show how to use predicate abstraction, in the sense used in model checking, to generate search guidance, inion, in the sense used in model checking, to generate search guidance, in the sense used in Artificial Intelligence (AI). This contributes another family of heuristic functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004